Efficient graph state generation and operation error detection with a controlled-path gate

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal State Graph Generation

We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veriication and control synthesis in reactive program compilation.

متن کامل

Minimal State Graph Generation

We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veri cation and control synthesis in reactive program compilation.

متن کامل

Weighted Optimal Path in Graph with Multiple Indexes

This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...

متن کامل

Safe-Path Graph Generation for Path Planning in Urban Environments

To serve as a platform for multi-agent research, the BYU MAGICC Lab has created a version of the game of capturethe-flag played in a maze environment that can be configured to model a variety of indoor and urban settings. Each competing team has mobile robots on the ground, a simulated UAV flying overhead, and a remote human commander. Since simultaneous low-level control of all robots is not p...

متن کامل

More Efficient Purifying scheme via Controlled- Controlled NOT Gate

A new modified version of the Oxford purification protocol is proposed. This version is based on the controlled-controlled NOT gate instead of controlled NOT in the original one. Comparisons between the results of the new version and the original and an earlier modification are given. It is found that the new version converges faster and consumes fewer initial qubit pairs of low fidelity per fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics B: Atomic, Molecular and Optical Physics

سال: 2013

ISSN: 0953-4075,1361-6455

DOI: 10.1088/0953-4075/46/5/055502